Dependently typed programming

Results: 102



#Item
41Towards explicit rewrite rules in the λΠ-calculus modulo Ronan Saillard MINES ParisTech Fontainebleau, France

Towards explicit rewrite rules in the λΠ-calculus modulo Ronan Saillard MINES ParisTech Fontainebleau, France

Add to Reading List

Source URL: www.cri.ensmp.fr

Language: English - Date: 2014-01-27 09:23:05
42CoqInE: Translating the Calculus of Inductive Constructions into the λΠ-calculus Modulo Mathieu Boespflug1 and Guillaume Burel2 1 McGill University Montr´eal, Qu´ebec, Canada

CoqInE: Translating the Calculus of Inductive Constructions into the λΠ-calculus Modulo Mathieu Boespflug1 and Guillaume Burel2 1 McGill University Montr´eal, Qu´ebec, Canada

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2012-07-23 07:37:37
43The λΠ-calculus Modulo as a Universal Proof Language Mathieu Boespflug1 , Quentin Carbonneaux2 and Olivier Hermant3 1  2

The λΠ-calculus Modulo as a Universal Proof Language Mathieu Boespflug1 , Quentin Carbonneaux2 and Olivier Hermant3 1 2

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2012-07-25 10:49:31
44Dedukti: a Universal Proof Checker Ronan Saillard MINES ParisTech  Context The success of formal methods both as tools of practical importance and as objects of intellectual curiosity, has spaw

Dedukti: a Universal Proof Checker Ronan Saillard MINES ParisTech Context The success of formal methods both as tools of practical importance and as objects of intellectual curiosity, has spaw

Add to Reading List

Source URL: www.cri.ensmp.fr

Language: English - Date: 2013-06-14 08:53:53
45The Peirce Translation and the Double Negation Shift Mart´ın Escard´o1 and Paulo Oliva2 1 2

The Peirce Translation and the Double Negation Shift Mart´ın Escard´o1 and Paulo Oliva2 1 2

Add to Reading List

Source URL: www.cs.bham.ac.uk

Language: English - Date: 2010-03-30 08:27:21
46MLL normalization and transitive closure: circuits, complexity, and Euler tours Harry Mairson  Problem: Given a proofnet in multiplicative linear

MLL normalization and transitive closure: circuits, complexity, and Euler tours Harry Mairson Problem: Given a proofnet in multiplicative linear

Add to Reading List

Source URL: www.cs.brandeis.edu

Language: English - Date: 2008-03-28 12:21:03
47An Introduction to Program Verification with the Coq Proof Assistant NII Lectures Series  Fr´ed´eric Loulergue

An Introduction to Program Verification with the Coq Proof Assistant NII Lectures Series Fr´ed´eric Loulergue

Add to Reading List

Source URL: www.nii.ac.jp

Language: English - Date: 2013-11-04 20:56:12
48Under consideration for publication in J. Functional Programming  1 Parametricity, Type Equality and Higher-order Polymorphism

Under consideration for publication in J. Functional Programming 1 Parametricity, Type Equality and Higher-order Polymorphism

Add to Reading List

Source URL: www.cis.upenn.edu

Language: English - Date: 2014-07-10 05:47:07
49Towards Generic Inductive Constructions in Systems of Nets Stéphane Gimenez Institute of Computer Science University of Innsbruck, Austria

Towards Generic Inductive Constructions in Systems of Nets Stéphane Gimenez Institute of Computer Science University of Innsbruck, Austria

Add to Reading List

Source URL: www.imn.htwk-leipzig.de

Language: English - Date: 2013-08-26 10:13:14
50Dependently Typed Programming with Singletons Richard A. Eisenberg Stephanie Weirich  University of Pennsylvania

Dependently Typed Programming with Singletons Richard A. Eisenberg Stephanie Weirich University of Pennsylvania

Add to Reading List

Source URL: www.seas.upenn.edu

Language: English - Date: 2014-07-10 05:47:08